Multi-hop all-to-all optical routings in Cartesian product networks
نویسندگان
چکیده
This paper considers the wavelength assignment problem for Cartesian product networks with multi-hops. An upper bound of the (uniform) wavelength index for Cartesian product networks with single-hop is established. This result leads to a consequence for the nth power of an arbitrary network with k-hops. In particular, if k = 1, this bound partially generalizes the results of Pankaj [R.K. Pankaj, Architectures for linear lightwave networks, PhD thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1992], Bermond et al. [J.-C. Bermond, L. Gargano, S. Perennes, A.A. Rescigno, U. Vaccaro, Efficient collective communication in optical networks, Theoret. Comput. Sci. 233 (2000) 165–189] and Beauquier [B. Beauquier, All-to-all communication for some wavelength-routed all-optical networks, Networks 33 (1999) 179–187] for hypercubes and Hamming graphs. As an application, a tight upper bound for Hamming graph with k hops is established and a corresponding open problem is also proposed. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Uniform Multi - hop All - to - All Optical
We consider all-to-all routing problem in an optical ring network that uses the wavelength-division multiplexing (WDM). Since one-hop, all-to-all optical routing in a WDM optical ring of n nodes needs ! w (Cn; IA; 1) = d 1 2 b n 2 4 ce wavelengths which can be too large even for moderate values of n, we consider in this paper j-hop implementations of all-to-all routing in a WDM optical ring, j ...
متن کاملDetermining Cluster-Heads in Mobile Ad-Hoc Networks Using Multi-Objective Evolutionary based Algorithm
A mobile ad-hoc network (MANET), a set of wirelessly connected sensor nodes, is a dynamic system that executes hop-by-hop routing independently with no external help of any infrastructure. Proper selection of cluster heads can increase the life time of the Ad-hoc network by decreasing the energy consumption. Although different methods have been successfully proposed by researchers to tackle...
متن کاملTowards Energy Efficient LPWANs through Learning-based Multi-hop Routing for the Uplink
Low-power wide area networks (LPWANs) have been identified as one of the top emerging wireless technologies due to their autonomy and wide range of applications. Yet, the limited energy resources of battery-powered sensor nodes is a top constraint; specially when adopting single-hop topologies since nodes located far from the base station must transmit in high power levels. On this point, multi...
متن کاملA Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کاملAn Efficient Multicast Routing in Wireless Multi-hop Mesh Networks
In order that multicast routing characteristics are reflected under wireless environments, multicast routing metric is required for qualifying the multicast tree cost in wireless multi-hop mesh networks. We design a new multicast routing metric called the multicast-tree transmission ratio which quantifies the multicast tree cost, considering the link quality of wireless multicast channels as we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 107 شماره
صفحات -
تاریخ انتشار 2008